n=int(input())
s=0
for i in range(n):
s0=int(input())
s0-=i+1
if i==0:
s=s0
print(s0)
elif i!=0 and s0>s:
s=s0
print(s0)
elif i!=0 and s0<=s:
s+=1
print(s)#include <bits/stdc++.h>
using namespace std;
int main(){
int t,a=-1,b=1;
cin>>t;
while(t--){
int n;
cin>>n;
a=max(n-b, a+1);
cout<<a<<endl;
b++;
}
}
405A - Gravity Flip | 499B - Lecture |
709A - Juicer | 1358C - Celex Update |
1466B - Last minute enhancements | 450B - Jzzhu and Sequences |
1582C - Grandma Capa Knits a Scarf | 492A - Vanya and Cubes |
217A - Ice Skating | 270A - Fancy Fence |
181A - Series of Crimes | 1638A - Reverse |
1654C - Alice and the Cake | 369A - Valera and Plates |
1626A - Equidistant Letters | 977D - Divide by three multiply by two |
1654B - Prefix Removals | 1654A - Maximum Cake Tastiness |
1649A - Game | 139A - Petr and Book |
1612A - Distance | 520A - Pangram |
124A - The number of positions | 1041A - Heist |
901A - Hashing Trees | 1283A - Minutes Before the New Year |
1654D - Potion Brewing Class | 1107B - Digital root |
25A - IQ test | 785A - Anton and Polyhedrons |